43 research outputs found
Spatial mixing and the connective constant: Optimal bounds
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model (which is defined as a weighted sum over all matchings where each matching is given a weight γ^(|V| –2|M|) in terms of a fixed parameter γ called the monomer activity) and the hard core model (which is defined as a weighted sum over all independent sets where an independent set I is given a weight γ^(|I|) in terms of a fixed parameter γ called the vertex activity). The connective constant is a natural measure of the average degree of a graph which has been studied extensively in combinatorics and mathematical physics, and can be bounded by a constant even for certain unbounded degree graphs such as those sampled from the sparse Erdös-Rényi model (n, d/n).
Our main technical contribution is to prove the best possible rates of decay of correlations in the natural probability distributions induced by both the hard core model and the monomer-dimer model in graphs with a given bound on the connective constant. These results on decay of correlations are obtained using a new framework based on the so-called message approach that has been extensively used recently to prove such results for bounded degree graphs. We then use these optimal decay of correlations results to obtain FPTASs for the two problems on graphs of bounded connective constant.
In particular, for the monomer-dimer model, we give a deterministic FPTAS for the partition function on all graphs of bounded connective constant for any given value of the monomer activity. The best previously known deterministic algorithm was due to Bayati, Gamarnik, Katz, Nair and Tetali [STOC 2007], and gave the same runtime guarantees as our results but only for the case of bounded degree graphs. For the hard core model, we give an FPTAS for graphs of connective constant Δ whenever the vertex activity λ λ_c(Δ) would imply that NP=RP [Sly, FOCS 2010]. The previous best known result in this direction was a recent paper by a subset of the current authors [FOCS 2013], where the result was established under the suboptimal condition λ < λc(Δ + 1).
Our techniques also allow us to improve upon known bounds for decay of correlations for the hard core model on various regular lattices, including those obtained by Restrepo, Shin, Vigoda and Tetali [FOCS 11] for the special case of ℤ^2 using sophisticated numerically intensive methods tailored to that special case
Spatial mixing and the connective constant: optimal bounds
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model (which is defined as a weighted sum over all matchings where each matching is given a weight γ|V|−2|M| in terms of a fixed parameter γ called the monomer activity) and the hard core model (which is defined as a weighted sum over all independent sets where an independent set I is given a weight λ^(|I|) in terms of a fixed parameter λ called the vertex activity). The connective constant is a natural measure of the average degree of a graph which has been studied extensively in combinatorics and mathematical physics, and can be bounded by a constant even for certain unbounded degree graphs such as those sampled from the sparse Erdős–Rényi model G(n,d/n). Our main technical contribution is to prove the best possible rates of decay of correlations in the natural probability distributions induced by both the hard core model and the monomer-dimer model in graphs with a given bound on the connective constant. These results on decay of correlations are obtained using a new framework based on the so-called message approach that has been extensively used recently to prove such results for bounded degree graphs. We then use these optimal decay of correlations results to obtain fully polynomial time approximation schemes (FPTASs) for the two problems on graphs of bounded connective constant. In particular, for the monomer-dimer model, we give a deterministic FPTAS for the partition function on all graphs of bounded connective constant for any given value of the monomer activity. The best previously known deterministic algorithm was due to Bayati et al. (Proc. 39th ACM Symp. Theory Comput., pp. 122–127, 2007), and gave the same runtime guarantees as our results but only for the case of bounded degree graphs. For the hard core model, we give an FPTAS for graphs of connective constant Δ whenever the vertex activity λ λ_c(Δ) would imply that NP=RP (Sly and Sun, Ann. Probab. 42(6):2383–2416, 2014). The previous best known result in this direction was in a recent manuscript by a subset of the current authors (Proc. 54th IEEE Symp. Found. Comput. Sci., pp 300–309, 2013), where the result was established under the sub-optimal condition λ < λ_c(Δ+1). Our techniques also allow us to improve upon known bounds for decay of correlations for the hard core model on various regular lattices, including those obtained by Restrepo et al. (Probab Theory Relat Fields 156(1–2):75–99, 2013) for the special case of Z^2 using sophisticated numerically intensive methods tailored to that special case
Identity Testing for High-Dimensional Distributions via Entropy Tensorization
We present improved algorithms and matching statistical and computational
lower bounds for the problem of identity testing -dimensional distributions.
In the identity testing problem, we are given as input an explicit distribution
, an , and access to a sampling oracle for a hidden
distribution . The goal is to distinguish whether the two distributions
and are identical or are at least -far apart. When
there is only access to full samples from the hidden distribution , it is
known that exponentially many samples may be needed, and hence previous works
have studied identity testing with additional access to various conditional
sampling oracles. We consider here a significantly weaker conditional sampling
oracle, called the Coordinate Oracle, and provide a fairly complete
computational and statistical characterization of the identity testing problem
in this new model.
We prove that if an analytic property known as approximate tensorization of
entropy holds for the visible distribution , then there is an efficient
identity testing algorithm for any hidden that uses
queries to the Coordinate Oracle. Approximate
tensorization of entropy is a classical tool for proving optimal mixing time
bounds of Markov chains for high-dimensional distributions, and recently has
been established for many families of distributions via spectral independence.
We complement our algorithmic result for identity testing with a matching
statistical lower bound for the number of queries under
the Coordinate Oracle. We also prove a computational phase transition: for
sparse antiferromagnetic Ising models over , in the regime where
approximate tensorization of entropy fails, there is no efficient identity
testing algorithm unless RP=NP
Fast sampling via spectral independence beyond bounded-degree graphs
Spectral independence is a recently-developed framework for obtaining sharp
bounds on the convergence time of the classical Glauber dynamics. This new
framework has yielded optimal sampling algorithms on
bounded-degree graphs for a large class of problems throughout the so-called
uniqueness regime, including, for example, the problems of sampling independent
sets, matchings, and Ising-model configurations.
Our main contribution is to relax the bounded-degree assumption that has so
far been important in establishing and applying spectral independence. Previous
methods for avoiding degree bounds rely on using -norms to analyse
contraction on graphs with bounded connective constant (Sinclair, Srivastava,
Yin; FOCS'13). The non-linearity of -norms is an obstacle to applying
these results to bound spectral independence. Our solution is to capture the
-analysis recursively by amortising over the subtrees of the recurrence
used to analyse contraction. Our method generalises previous analyses that
applied only to bounded-degree graphs.
As a main application of our techniques, we consider the random graph
, where the previously known algorithms run in time
or applied only to large . We refine these algorithmic bounds significantly,
and develop fast algorithms based on Glauber dynamics that apply
to all , throughout the uniqueness regime
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
For general spin systems, we prove that a contractive coupling for any local
Markov chain implies optimal bounds on the mixing time and the modified
log-Sobolev constant for a large class of Markov chains including the Glauber
dynamics, arbitrary heat-bath block dynamics, and the Swendsen-Wang dynamics.
This reveals a novel connection between probabilistic techniques for bounding
the convergence to stationarity and analytic tools for analyzing the decay of
relative entropy. As a corollary of our general results, we obtain
mixing time and modified log-Sobolev constant of
the Glauber dynamics for sampling random -colorings of an -vertex graph
with constant maximum degree when for
some fixed . We also obtain mixing time and
modified log-Sobolev constant of the Swendsen-Wang dynamics for the
ferromagnetic Ising model on an -vertex graph of constant maximum degree
when the parameters of the system lie in the tree uniqueness region. At the
heart of our results are new techniques for establishing spectral independence
of the spin system and block factorization of the relative entropy. On one hand
we prove that a contractive coupling of a local Markov chain implies spectral
independence of the Gibbs distribution. On the other hand we show that spectral
independence implies factorization of entropy for arbitrary blocks,
establishing optimal bounds on the modified log-Sobolev constant of the
corresponding block dynamics